A Mergeable Interval Map
نویسندگان
چکیده
This article describes an efficient persistent mergeable data structure for mapping intervals to values. We call this data structure rangemap. We provide an example of application where the need for such a data structure arises (abstract interpretation of programs with pointer casts). We detail different solutions we have considered and dismissed before reaching the solution of rangemaps. We show how they solve the initial problem and eventually describe their implementation.
منابع مشابه
Checking Mergeable Priority Queues
We present an eecient algorithm which can check the answers given by the fundamental abstract data types priority queues and mergeable priority queues. This is the rst linear-time checker for mergeable priority queues. These abstract data types are widely used in routing, scheduling, simulation, computational geometry and many other algorithmic domains. We have implemented our answer checker an...
متن کاملA Simple Mergeable Dictionary
A mergeable dictionary is a data structure storing a dynamic subset S of a totally ordered set U and supporting predecessor searches in S. Apart from insertions and deletions to S, we can both merge two arbitrarily interleaved dictionaries and split a given dictionary around some pivot x ∈ U . We present an implementation of a mergeable dictionary matching the optimal amortized logarithmic boun...
متن کاملSOME RESULTS OF CONTINUITY ?f
The dynamical behavior of a map on the unit interval has been the subject of much contemporary research. In this paper, we will consider the relation between the continuity of the map cof and cof for some positive integer k, where f is a continuous map from the unit interval to itself, and ?f is a function which takes any element of the unit interval to the set of all subsequential limits o...
متن کاملA Mergeable Summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into a single summary on the two data sets combined together, while preserving the error and size guarantees. This property means that the summaries can be merged in a way akin to other algebraic operators such as sum and m...
متن کاملTransactions on Mergeable Objects
Destructible updates on shared objects require careful handling of concurrent accesses in multi-threaded programs. Paradigms such as Transactional Memory support the programmer in correctly synchronizing access to mutable shared data by serializing the transactional reads and writes. But under high contention, serializable transactions incur frequent aborts and limit parallelism. This can lead ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Stud. Inform. Univ.
دوره 9 شماره
صفحات -
تاریخ انتشار 2011